Binary Image Restoration by Signomial Programming
نویسندگان
چکیده
We present a signomial programming optimization approach to restore binary images which are degraded by additive white Gaussian noise. Numerical experiments confirm the proposed approach is efficient with good accuracy. c © 2007 Optical Society of America OCIS codes: (100.2000) Digital image processing; (100.3020) Image reconstruction-restoration
منابع مشابه
Multi-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method
This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...
متن کاملAn enhanced logarithmic method for signomial programming with discrete variables
Signomial programming problems with discrete variables (SPD) appear widely in real-life applications, but they are hard to solve. This paper proposes an enhanced logarithmic method to reformulate the SPD problem as a mixed 0-1 linear program (MILP) with a minimum number of binary variables and inequality constraints. Both of the theoretical analysis and numerical results strongly support its su...
متن کاملDISCRETE TOMOGRAPHY AND FUZZY INTEGER PROGRAMMING
We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.
متن کاملMM algorithms for geometric and signomial programming
This paper derives new algorithms for signomial programming, a generalization of geometric programming. The algorithms are based on a generic principle for optimization called the MM algorithm. In this setting, one can apply the geometric-arithmetic mean inequality and a supporting hyperplane inequality to create a surrogate function with parameters separated. Thus, unconstrained signomial prog...
متن کاملGeometric programming with signomials
The difference of two "posynomials" (namely, polynomials with arbitrary real exponents, but positive coefficients and positive independent variables) is termed a signomial. Each signomial program (in which a signomial is to be either minimized or maximized subject to signomial constraints) is transformed into an equivalent posynomial program in which a posynomial is to be minimized subject only...
متن کامل